Group Size Counting Problem in Computer Go Has a Way to Autonomously Count the Size of Graphs in a Grid World

Computer Go has been a new unconquered challenge to the Artificial Intelligence (AI) and Computational Intelligence (CI) societies since 1997 when Garry Kasparov, the human Chess champion, was defeated by the IBM supercomputer Deep Blue. Computer Go is not only an unsolved problem by itself, but also serves as an excellent test bed for a novel technique to apply it to a practical problem since Go’s clear-cut objective and the vast amount of sub-problems help to test out the novelty’s practicality. We propose a novel, distributed approach to count the size of groups of connected stones on a Go board. This scheme guarantees to answer the correct group size on a Go board in an autonomous and scalable manner. We also discover the solution in computer Go works to autonomously count the size of graphs in a grid world as well.